//	ID : pallab81
// 	PROG : 216
// 	LANG : C++
// 	2011-09-02-10.58.50 Friday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define x_ first
#define y_ second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ) {
        ;
    }
}
int N;
vector < pair<int,int> > vt;
inline void Read() {
    vt.assign(N,mk(0,0));
    fo(i,0,N) {
        CI(vt[i].x_);
        CI(vt[i].y_);
    }
}
inline double dist(int i, int j) {
    int X = vt[i].x_-vt[j].x_;
    int Y = vt[i].y_-vt[j].y_;
    double XY =  sqrt( (double)( X*X + Y*Y ) );
    return XY;
}

inline void doit(){
    VI p(N,0);
    VI d(N,0);
    fo(i,0,N){
        p[i]=i;
    }
    double best = -1;
    do{
        double total=0;
        fo(i,1,N){
            total+= dist( p[i-1] , p[i]  );
            total+=16;
        }
        if(best == -1 || total < best ){
                best=total;
                fo(i,0,N){
                    d[i]=p[i];
                }
        }

    }while( next_permutation(p.begin(),p.end()) );
    fo(i,1,N){
        int fx = vt[ d[i-1] ].x_;
        int fy = vt[ d[i-1] ].y_;
        int tx = vt[ d[i] ].x_;
        int ty = vt[ d[i] ].y_;
        printf("Cable requirement to connect (%d,%d) to (%d,%d) is %.2lf feet.\n",fx,fy,tx,ty,dist( d[i-1] , d[i]  )+(double)16. );
    }
    printf("Number of feet of cable required is %.2lf.\n",best);
}
inline void Proc(int cases) {
    printf("**********************************************************\nNetwork #%d\n",cases);
    doit();
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","rt",stdin);
#endif

    for( int cases=1; scanf("%d",&N)==1 && N ; ++cases ) {
        Read();
        Proc(cases);
    }

    return 0;
}
